Determining The Degree of Generalization Using An Incremental Learning Algorithm

نویسندگان

  • Pablo Zegers
  • Malur K. Sundareshan
چکیده

Any Learning Machine (LM) trained with examples poses the same problem: how to determine whether the LM has achieved an acceptable level of generalization or not. This work presents a training method that uses the data set in an incremental manner such that it is possible to determine when the behavior displayed by the LM during the learning stage truthfully represents its future behavior when confronted by unseen data samples. The method uses the set of samples in an efficient way, which allows discarding all those samples not really needed for the training process. The new training procedure, which will be called “Incremental Training Algorithm”, is based on a theoretical result that is proven using recent developments in statistical learning theory. A key aspect of this analysis involves identification of three distinct stages through which the learning process normally proceeds, which in turn can be translated into a systematic procedure for determining the generalization level achieved during training. It must be emphasized that the presented algorithm is general and independent of the architecture of the LM and the specific training algorithm used. Hence it is applicable to a broad class of supervised learning problems and not restricted to the example presented in this work.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Determining the Degree of Generalization Using an Incremental Learning

Any Learning Machine (LM) trained with examples poses the same problem: how to determine whether the LM has achieved an acceptable level of generalization or not. This work presents a training method that uses the data set in an incremental manner such that it is possible to determine when the behavior displayed by the LM during the learning stage truthfully represents its future behavior when ...

متن کامل

Solving Fuzzy Equations Using Neural Nets with a New Learning Algorithm

Artificial neural networks have the advantages such as learning, adaptation, fault-tolerance, parallelism and generalization. This paper mainly intends to offer a novel method for finding a solution of a fuzzy equation that supposedly has a real solution. For this scope, we applied an architecture of fuzzy neural networks such that the corresponding connection weights are real numbers. The ...

متن کامل

A Hybrid Framework for Building an Efficient Incremental Intrusion Detection System

In this paper, a boosting-based incremental hybrid intrusion detection system is introduced. This system combines incremental misuse detection and incremental anomaly detection. We use boosting ensemble of weak classifiers to implement misuse intrusion detection system. It can identify new classes types of intrusions that do not exist in the training dataset for incremental misuse detection. As...

متن کامل

An Incremental DC Algorithm for the Minimum Sum-of-Squares Clustering

Here, an algorithm is presented for solving the minimum sum-of-squares clustering problems using their difference of convex representations. The proposed algorithm is based on an incremental approach and applies the well known DC algorithm at each iteration. The proposed algorithm is tested and compared with other clustering algorithms using large real world data sets.

متن کامل

Solving Fuzzy Equations Using Neural Nets with a New Learning Algorithm

Artificial neural networks have the advantages such as learning, adaptation, fault-tolerance, parallelism and generalization. This paper mainly intends to offer a novel method for finding a solution of a fuzzy equation that supposedly has a real solution. For this scope, we applied an architecture of fuzzy neural networks such that the corresponding connection weights are real numbers. The ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002